Characterization of Orlicz admissibility
نویسندگان
چکیده
Abstract We extend two characterizations of admissible operators with respect to $$\textrm{L}^p$$ L p more general Orlicz spaces. The equivalent conditions are given by the property that an associated operator generates a strongly continuous semigroup and in terms resolvent estimate.
منابع مشابه
Characterization of matrix operators on Orlicz spaces
We give equivalent conditions for tensor product of Orlicz sequence spaces, then we obtain a necessary and sufficient condition for a class of matrix operators acting on Orlicz sequence spaces to be continuous and compact.
متن کاملCharacterization of Entire Sequences via Double Orlicz Space
Throughout, w, Γ, and∧ denote the classes of all, entire, and analytic scalar-valued single sequences, respectively. We write w2 for the set of all complex sequences (xmn), where m,n ∈ N is the set of positive integers. Then, w2 is a linear space under the coordinatewise addition and scalar multiplication. Some initial works on double sequence spaces are found in Bromwich [1]. Later on, they we...
متن کاملsynthesis and characterization of some macrocyclic schiff bases
ماکروسیکلهای شیف باز از اهمیت زیادی در شیمی آلی و دارویی برخوردار می باشند. این ماکروسیکلها با دارابودن گروه های مناسب در مکانهای مناسب می توانند فلزاتی مثل مس، نیکل و ... را در حفره های خود به دام انداخته، کمپلکسهای پایدار تولید نمایند. در این پایان نامه ابتدا یک دی آلدئید آروماتیک از گلیسیرین تهیه می شود و در مرحله بعدی واکنش با دی آمینهای آروماتیک و یا آلیفاتیک در رقتهای بسیار زیاد منجر به ت...
15 صفحه اولInference Rules in Nelson's Logics, Admissibility and Weak Admissibility
Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....
متن کاملAdmissibility and Event-rationality Admissibility and Event-rationality
We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their conjectures. A player is event-rational if she best responds to a conjecture and uses a list of subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2023
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-023-10352-3